Nearly Tight Approximability Results for Minimum Biclique Cover and Partition

In this paper, we consider the minimum biclique cover and minimum biclique partition problems on bipartite graphs. In the minimum biclique cover problem, we are given an input bipartite graph G = (V,E), and our goal is to compute the minimum number of complete bipartite subgraphs that cover all edges of G. This problem, besides its correspondence to a well-studied notion of bipartite dimension in graph theory, has applications in many other research areas such as artificial intelligence, computer security, automata theory, and biology. Since it is NP-hard, past research has focused on approximation algorithms, fixed parameter tractability, and special graph classes that admit polynomial time exact algorithms. For the minimum biclique partition problem, we are interested in a biclique cover that covers each edge exactly once. We revisit the problems from approximation algorithms’ perspectives and give nearly tight lower and upper bound results. We first show that both problems are NP-hard to approximate to within a factor of n1−ε (where n is the number of vertices in the input graph). Using a stronger complexity assumption, the hardness becomes Ω̃(n), where Ω̃(·) hides lower order terms. Then we show that approximation factors of the form n/(logn) for some γ > 0 can be obtained. Our hardness results have many consequences: (i) Ω̃(n) hardnesses for computing the Boolean rank and non-negative integer rank of an n-byn matrix (ii) Ω̃(n) hardness for minimizing the number of states in a deterministic finite automaton (DFA), given an n-state DFA as input, and (iii) Ω̃( √ n) hardness for computing minimum NFA from a truth table of size n. These results settle some of the most basic problems in the area of regular language optimization.